Possibility results for graph clustering: A novel consistency axiom

نویسندگان

چکیده

Kleinberg introduced three natural clustering properties, or axioms, and showed they cannot be simultaneously satisfied by any algorithm. We present a new property, Monotonic Consistency, which avoids the well-known problematic behaviour of Kleinberg’s Consistency axiom, impossibility result. Namely, we describe algorithm, Morse Clustering, inspired Theory in Differential Topology, satisfies original axioms with replaced Consistency. uncovers underlying flow structure on set graph returns partition into trees representing basins attraction critical vertices. also generalise axiomatic approach to sparse graphs, showing an result for possibility clustering.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Revisit to Probability - Possibility Consistency Principles

In this article, our main intention is to highlight the fact that the probable links between probability and possibility which were established by different authors at different point of time on the basis of some well known consistency principles cannot provide the desired result. That is why the paper discussed some prominent works for transformations between probability and possibility and fi...

متن کامل

Finding Community Base on Web Graph Clustering

Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...

متن کامل

A Novel Clustering Approach for Estimating the Time of Step Changes in Shewhart Control Charts

  Although control charts are very common to monitoring process changes, they usually do not indicate the real time of the changes. Identifying the real time of the process changes is known as change-point estimation problem. There are a number of change point models in the literature however most of the existing approaches are dedicated to normal processes. In this paper we propose a novel app...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2022

ISSN: ['1873-5142', '0031-3203']

DOI: https://doi.org/10.1016/j.patcog.2022.108687